Random clique evolving network model and their communicability
نویسندگان
چکیده
منابع مشابه
Hybrid evolving clique-networks and their communicability
Aiming to understand real-world hierarchical networks whose degree distributions are neither power law nor exponential, we construct a hybrid clique network that includes both homogeneous and inhomogeneous parts, and introduce an inhomogeneity parameter to tune the ratio between the homogeneous part and the inhomogeneous one. We perform Monte-Carlo simulations to study various properties of suc...
متن کاملCommunicability across evolving networks.
Many natural and technological applications generate time-ordered sequences of networks, defined over a fixed set of nodes; for example, time-stamped information about "who phoned who" or "who came into contact with who" arise naturally in studies of communication and the spread of disease. Concepts and algorithms for static networks do not immediately carry through to this dynamic setting. For...
متن کاملHigh-dimensional random geometric graphs and their clique number
We study the behavior of random geometric graphs in high dimensions. We show that as the dimension grows, the graph becomes similar to an Erdős-Rényi random graph. We pay particular attention to the clique number of such graphs and show that it is very close to that of the corresponding Erdős-Rényi graph when the dimension is larger than log n where n is the number of vertices. The problem is m...
متن کاملA simple asymmetric evolving random network
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical asymmetry between incoming and outgoing edges. We show that the model exhibits a percolation transition and discuss its universality. Below the threshold, the ...
متن کاملCommunity detection based on network communicability.
We propose a new method for detecting communities based on the concept of communicability between nodes in a complex network. This method, designated as N-ComBa K-means, uses a normalized version of the adjacency matrix to build the communicability matrix and then applies K-means clustering to find the communities in a graph. We analyze how this method performs for some pathological cases found...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Physica, Mechanica & Astronomica
سال: 2014
ISSN: 1674-7275
DOI: 10.1360/sspma2013-00083